On invariant closed curves for one-step methods

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Invariant Curves for Numerical Methods

The problem of finding periodic orbits of dynamical systems numerically is considered. It is shown that if a convergent, strongly stable, multi-step method is employed then under some suitable conditions, there exist invariant curves. The result also shows that the rates of convergence toward the invariant curves are roughly the same for different methods and different step sizes. Introduction....

متن کامل

1 Some Methods for the Global Analysis of Closed Invariant Curves in Two-Dimensional Maps

It is well known that models of nonlinear oscillators applied to the study of the business cycle can be formulated both as continuos or discrete time dynamic models (see e.g. [23], [33], [34]). However, economic time is often discontinuous (discrete) because decisions in economics cannot be continuously revised. For this reason discrete-time dynamical systems, represented by difference equation...

متن کامل

Theory and Methods for One -step Odes

where f is continuous and outputs an Rd vector. approximation on grid functions Let y(t) be the true solution. LetH be the grid dened by step-sizes: h1 , . . . , hN such that 0 < t1 < . . . < tN satises t i = ∑ l=1 h i .1 Let ∣H∣ = maxi h i . 1 is is just the obvious grid where h i = t i − t i−1 . We are parameterizing it by the step-sizes h i instead of times because h is what shows up in th...

متن کامل

On Closed Twisted Curves

Twisted curves in R' are those which have independent derivatives up to order m . For plane and spatial curves the twisted condition is equivalent to never vanishing curvature and torsion respectively. We give a necessary and sufficient condition for a (q, p)-curve on a torus to be twisted, and use those curves to construct closed twisted curves in R'" for all m .

متن کامل

Block Implicit One - Step Methods

A class of one-step methods which obtain a block of r new values at each step are studied. The asymptotic behavior of both implicit and predictor-corrector procedures is examined.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Numerische Mathematik

سال: 1987

ISSN: 0029-599X,0945-3245

DOI: 10.1007/bf01399697